Pseudorandom binary sequences: quality measures and number-theoretic constructions

نویسندگان

چکیده

In this survey we summarize properties of pseudorandomness and non-randomness some number-theoretic sequences present results on their behaviour under the following measures pseudorandomness: balance, linear complexity, correlation measure order k, expansion complexity 2-adic complexity. The are Legendre sequence two-prime generator, Thue-Morse its sub-sequence along squares, prime omega for integers polynomials.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructions of Pseudorandom Binary Lattices

Three constructions for binary lattices with strong pseudorandom properties are given. These constructions are the two dimensional extensions and modifications of three of the most important one dimensional constructions. The upper estimates for the pseudorandom measures of the binary lattices constructed are based on the principle that character sums in two variables can be estimated by fixing...

متن کامل

On p-pseudorandom binary sequences

where the maximum is taken over all a, b, t ∈ IN such that 1 ≤ a ≤ a + (t − 1)b ≤ N , while the correlation measure of order k of EN is defined as Research of the second author is partially supported by Hungarian National Foundation for Scientific Research, Grant no. T043623. This paper was written while the second author was visiting the Institut de Mathématiques de Luminy (UPR 9016 CNRS), Mar...

متن کامل

Concatenation of pseudorandom binary sequences

In the applications it may occur that our initial pseudorandom binary sequence turns out to be not long enough, thus we have to take the concatenation or merging of it with another pseudorandom binary sequences. Here our goal is study when can we form the concatenation of several pseudorandom binary sequences belonging to a given family? We introduce and study new measures which can be used for...

متن کامل

Z8-Kerdock codes and pseudorandom binary sequences

The Z8-analogues of the Kerdock codes of length n 1⁄4 2 were introduced by Carlet in 1998. We study the binary sequences of period n 1 obtained from their cyclic version by using the most significant bit (MSB)-map. The relevant Boolean functions are of degree 4 in general. The linear span of these sequences has been known to be of the order of m:We will show that the crosscorrelation and nontri...

متن کامل

Correlation of Pseudorandom Binary Sequences from de Bruijn Graphs

Binary sequences with good correlation properties play an important role in many secure communication systems and testing of systems. In this paper, we describe and illustrate sets of pseudorandom sequences from de Bruijn graphs which have good correlation functions and critically analyze how we investigate all homomorphisms that give low correlation values between the binary sequences. We comp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

سال: 2023

ISSN: ['1745-1337', '0916-8508']

DOI: https://doi.org/10.1587/transfun.2023sdi0001